On Reachability and Spatial Reachability in Fragments of BioAmbients
نویسندگان
چکیده
BioAmbients is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of dialects of the full model and the comparison with other computational models. In this paper we investigate the limit between decidability and undecidability of two decision problems, namely reachability and spatial reachability, for semantic and syntactic fragments of BioAmbients providing movement capabilities and merge. Our results illustrate the power of merge with respect to the other movement operations of BA for properties like reachability. Furthermore, they establish an interesting connection between BioAmbients and other computational models like associative-commutative term rewriting and Petri nets with transfer arcs.
منابع مشابه
Reachability problems in BioAmbients
BioAmbients (BA) is a powerful model for representing various aspects of living cells. The model provides a rich set of operations for the movement and interaction of molecules. The richness of the language motivates the study of fragments of the full model and the comparison with other computational models. In this paper, we investigate the impact of the merge capability, used for fusing the c...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملDeciding Reachability in Mobile Ambients with Name Restriction
We investigate the reachability problem for fragments of the Mobile Ambients, a powerful model for distributed and mobile computation. By using a connection with associative-commutative term rewriting, we prove that reachability is decidable in the open-free fragment of pure Mobile Ambients with name restriction and weak reduction semantics. Processes in this model have three sources of infinit...
متن کاملReachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
In this paper we investigate the connection between fragments of Associative-Commutative Term Rewriting and fragments of Mobile Ambients, a powerful model for mobile and distributed computations. The connection can be used to transfer decidability and undecidability results for important computational properties like reachability from one formalism to the other. Furthermore, it can be viewed as...
متن کاملAnalysis of the reachability problem in fragments of the π - calculus
The π-calculus is one of the most important formalisms for analyzing and modelling concurrent systems. It is a simple but powerful tool for specifying and checking several properties in this kind of systems. An interesting property of any system is the ability to reach some special state where it has a particular behavior. In security systems this is extremely important, since we would like tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 171 شماره
صفحات -
تاریخ انتشار 2007